Computing Cartograms with Optimal Complexity
نویسندگان
چکیده
منابع مشابه
Complexity of Octagonal and Rectangular Cartograms
A cartogram is a type of map used to visualize data. In a map regions are displayed in their true shapes and with their exact relations with the adjacent regions. However, such a map can only be used to demonstrate the actual area values of the regions. Sometimes, we need to display other data on a map, such as population, pollution, electoral votes, production rates, etc. One efficient way to ...
متن کاملTable Cartograms
A table cartogram of a two dimensional m × n table A of non-negative weights in a rectangle R, whose area equals the sum of the weights, is a partition of R into convex quadrilateral faces corresponding to the cells of A such that each face has the same adjacency as its corresponding cell and has area equal to the cell’s weight. Such a partition acts as a natural way to visualize table data ari...
متن کاملThe Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
We consider the problems of finding the lexicographically minimal (or maximal) satisfying assignment of propositional formulae for different restricted formula classes. It turns out that for each class from our framework, the above problem is either polynomial time solvable or complete for OptP . We also consider the problem of deciding if in the optimal assignment the largest variable gets val...
متن کاملThe Complexity of Computing the Optimal Composition of Differential Privacy
In the study of differential privacy, composition theorems (starting with the original paper of Dwork, McSherry, Nissim, and Smith (TCC’06)) bound the degradation of privacy when composing several differentially private algorithms. Kairouz, Oh, and Viswanath (ICML’15) showed how to compute the optimal bound for composing k arbitrary ( , δ)differentially private algorithms. We characterize the o...
متن کاملSoft Computing: Coping with Complexity
While it has been correctly noted that the expression “soft computing” is employed in a variety of senses and characterizations to designate a wide array of technologies, we argue that the original motivation for the introduction of soft-computing methods was the need to cope with the complexity of existing mathematical and computational models of real-world systems. We review this essential mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2013
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-013-9521-1